Computing Tolls and Checking Equilibrium for Traac Flows
نویسنده
چکیده
We consider the problems of computing tolls and checking for equilibrium of ows in a traac network in which travelers act according to Wardrop's user-equilibrium principle. We provide an algorithm which, given any feasible distribution of traac ows, and the corresponding link traversal times, will either (i) determine that the given ows and travel times satisfy Wardrop's user-equilibrium principle or, if not, (ii) compute origin/destination-dependent tolls such that travelers will distribute themselves according to the given ow distribution. The behavior of the algorithm is such that its computation time should be close to linear in the number of origin/destination pairs times the number of links in the network. The algorithm can also be adjusted to check for equilibrium and compute tolls which are dependent only on destination. In that case the computation time should be close to linear in the number of destinations times the number of links.
منابع مشابه
1 Solving Congestion Tollpricing
Recently a methodology for traac networks has been developed which extracts congestion toll sets such that the tolled user equilibrium is system optimal. Properties of toll sets, such as convexity, are investigated, as well as relationships with other problems. For a given toll set, various objectives can be deened and optimized with respect to the tolls. Examples include minimizing the total t...
متن کاملPrice-directive Trafficmanagement: Applications of Sideconstrained Trafficequilibriummodels
We propose a systematic means for achieving a set of overall traac management or planning goals with respect to the performance of the traac network through the use of link tolls. The primary goals are deened by a set of link ow restrictions. The tolls that achieve these goals are obtained by solving a generalization of the classical user equilibrium model which includes a set of side constrain...
متن کاملTraffic Management through Link
We propose a systematic means for achieving a set of overall traac management or planning goals with respect to the performance of the traac network through the use of link tolls. The primary goals are deened by a set of link ow restrictions. The tolls that achieve these goals are obtained by solving a generalization of the classical user equilibrium model which includes a set of side constrain...
متن کاملComputing Optimal Tolls with Arc Restrictions and Heterogeneous Players
The problem of computing optimal network tolls that induce a Nash equilibrium of minimum total cost has been studied intensively in the literature, but mostly under the assumption that these tolls are unrestricted. Here we consider this problem under the more realistic assumption that the tolls have to respect some given upper bound restrictions on the arcs. The problem of taxing subnetworks op...
متن کاملMinimal Revenue Tolls: Price Stability for Networks With BPR Cost Function
Marginal-Cost (MC) tolls are known to produce economic efficiency of network flows. Yet, MC pricing has not been widely adopted, because of various perceived unpopular aspects, such as complexity, collection costs, and inequities. Minimal Revenue (MinRev) pricing has been suggested as a means to achieve most of the economic improvements of MC pricing with fewer unpopular aspects. One claimed im...
متن کامل